Clustering Intelligent Mobile Agents for Communications Networks

Intelligent mobile agents are sent between routers to carry out a set of required tasks. Mobile agents can carry algorithms and information to various routers that they visit, such as: timer, navigation algorithm, network information, stability of the network, and load traffic of the network. By clustering intelligent mobile agents, it is possible to minimize the cost of time for each agent to travel to its required routers and the number of intelligent mobile agents. Each router has certain capabilities and hence can only process certain requests of each intelligent agent. The problem is to group the intelligent mobile agents into a number of clusters such that each cluster has similarity in responding to a group of routers. This can significantly decrease the demand imposed upon a network for a set of required tasks to be performed. In this paper, we present the problem of multiple criteria clustering of intelligent mobile agents where the decision is to cluster mobile agents such that a group of similar intelligent mobile agents will visit a group of similar routers. This grouping will decrease the total number of visits and the total number of agents, decreasing demand on the network.